proceed intern confer data engin search social integr adheat influenc dbase diffus model propag hint match ad paper present adheat social ad model user influenc addit relev match ad tradition ad placement emploi relev model model match ad web page content user interest observ social network relev model suffer shortcom influenti user user contribut opinion seldom click ad highli relev expertis influenti user content activ attract user hint word summar expertis activ wide prefer propos adheat diffus hint word influenti user match ad user aggreg hint perform experi larg onlin amp commun half million user experiment result show adheat outperform relev model ctr click rate signific margin categori subject descriptor confuciu intellig discipl integr social search amp site continu flourish larg number user reli substitut incomplet miss search result paper present experi develop confuciu googl amp servic launch countri languag end confuciu emploi data mine subroutin har synergi web search social network present subroutin design goal algorithm effect servic qualiti describ techniqu experi scale subroutin mine massiv data set parallel algorithm collabor filter workshop program parallel algorithm mine larg dscale rich dmedia data plda parallel latent dirichlet alloc larg dscale applic abstract paper present plda parallel implement latent dirichlet alloc mpi mapreduc plda smooth storag comput bottleneck fault recoveri lengthi distribut comput show plda appli larg real world applic achiev good scalabl releas mpi plda open sourc http code googl plda apach licens parallel algorithm mine larg dscale rich dmedia data confuciu intelli confuciu intelli confuciu intellig discipl amp site continu flourish larg number user reli substitut incomplet miss search result paper present experi develop confuciu googl amp servic launch countri languag end confuciu emploi data mine subroutin har synergi web search social network present subroutin design goal algorithm effect servic qualiti describ techniqu experi scale subroutin mine massiv data set confuciu intellig discipl amp site continu flourish larg number user reli substitut incomplet miss search result paper present experi develop confuciu googl amp servic launch countri languag end confuciu emploi data mine subroutin har synergi web search social network present subroutin design goal algorithm effect servic qualiti describ techniqu experi scale subroutin mine massiv data set inform extract meet relat databas inform extract meet relat databas semant model knowledg represent multimedia data organ multimedia data social parallel spectral cluster abstract spectral cluster algorithm shown effect find cluster tradit algorithm spectral cluster suffer scalabl problem memori comput time dataset size larg perform cluster larg dataset propos parallel memori comput distribut comput empir studi larg document dataset data instanc larg photo dataset demonstr parallel algorithm effect allevi scalabl problem kei word parallel spectral cluster distribut comput combin collabor filter person commun recommend rapid growth amount data social network site made inform retriev increasingli challeng user paper propos collabor filter method combin collabor filter ccf perform person commun recommend multipl type occurr social data time filter method fuse semant user inform appli hybrid train strategi combin gibb sampl expect maxim algorithm handl larg scale dataset parallel comput speed model train empir studi orkut dataset show ccf effect scalabl web dscale imag annot abstract paper describ experi latent dirichlet alloc lda model imag perceptu featur word build larg scale imag tag system distribut comput lda paramet mapreduc empir studi show scalabl lda support imag annot effect effici rich media web scalabl landmark recognit extent data manag project googl bayesian reason sensor group dqueri diagnosi parallel approxim matrix factor kernel method scalabl index perceptu data parallel support vector machin distribut comput support vector machin svm suffer wide recogn scalabl problem memori comput time improv scalabl develop parallel svm algorithm psvm reduc memori perform row base approxim matrix factor load essenti data machin perform parallel comput denot number train instanc reduc matrix dimens factor significantli smaller number machin psvm reduc memori requir np improv comput time np empir studi show psvm effect psvm open sourc download rcmap effici creat high dqualiti euclidean embed semiparametr regress student process build mem dbase storag system stream media perform stream media server limit dual requir high disk throughput servic client simultan low memori decreas system cost achiev high disk throughput disk drive access larg io amort disk access overhead larg io impli increas requir expens dram greater system cost mem base storag emerg storag technolog predict offer price perform point dram disk drive studi propos storag architectur inexpens mem base storag devic intermedi layer dram disk drive temporarili stage larg disk io significantli lower cost present data layout mechan synchron io schedul algorithm real time storag retriev stream data augment storag system analyt evalu suggest mem augment storag hierarchi reduc cost improv throughput stream server significantli categori subject descriptor comput system organ gener system effici top dk hyperplan queri process multimedia inform retriev queri answer binari classifi separ instanc relev queri kernel method emploi train classifi class boundari repres hyperplan project space data instanc farthest hyperplan deem relev queri nearest hyperplan uncertain queri paper address twin problem effici retriev approxim set instanc farthest nearest queri hyperplan retriev instanc hyperplan base queri scenario map rang queri problem allow reus exist index structur empir evalu larg imag dataset confirm effect approach fotof web servic photo manag work present fotof ff web base person photo organ automat imag annot event manag social network integr describ techniqu real time onlin semant annot user photo addition landmark recognit system util local featur discuss scalabl servic photo annot share search work present detail implement fotof ff websit automat semant annot digit photograph event manag social network integr describ techniqu real time onlin semant annot global featur content context classif experi learn techniqu perform realworld data set addition scalabl landmark recognit system util local featur discuss fotowiki distribut map enhanc servic adapt dlinear cluster data stream mine blog stori commun dbase tempor cluster identifi color motion video sensor identifi match surfac color move object surveil video critic achiev reliabl object track search tradit color model provid surfac object flat object motion alter surfac orient light condit vari object move tackl research problem conduct extens data mine video clip collect light condit distanc video camera observ eleven cultur color drift color space object surfac motion color space learn drift pattern cultur color classifi unseen surfac color final devis distanc function take color drift consider perform color identif match empir studi show approach promis achiev color predict accuraci hyperspher index abstract featur select wide varieti data yield higher speed reduc comput cost classif process microarrai dataset advantag evid requir paper present approach accomplish base concept discern introduc depict separ class dataset develop test independ featur select method follow approach result experi microarrai dataset show discern base featur select reduc dimension dataset involv compromis perform classifi index term classif problem featur select dimension reduct discern microarrai data concept boundari detect speed svm support vector machin svm suffer train cost denot number train instanc paper propos algorithm select boundari instanc train data substanti reduc propos algorithm motiv result burg remov support vector train set chang svm train result algorithm elimin instanc support vector conceptindepend preprocess step algorithm prepar nearest neighbor list train instanc concept specif sampl step effect select train data target concept empir studi show algorithm effect reduc outperform compet downsampl algorithm significantli compromis test accuraci learn unifi kernel machin classif increment approxim matrix factor speed support vector machin unifi scalabl learn multimedia inform retriev kdx index support vector machin activ learn larg databas abstract queri queri keyword suffer problem alias mean imag keyword potenti variabl interpret multipl semant discern semant queri establish combin activ learn kernel method effect approach work examin activ learn strategi focu address challeng scalabl issu scalabl concept complex dataset size present remedi explain limit discuss futur direct research storag retriev method applic multimedia classifi ident peopl appear broadcast new video anchor report new subject import topic high level video analysi visual resembl type peopl work explor multi modal featur deriv varieti evid speech ident transcript clue tempor video structur name entiti statist learn approach combin featur person type classif experi conduct abc world new tonight video demonstr effect approach contribut categori featur compar keyword multi modal analysi person type classif broadcast new video learn dmetric proxim matric formul context ddepend similar function task inform retriev depend good distanc function measur similar data instanc effect distanc function formul context depend applic data user depend paper present method learn distanc function captur nonlinear relationship contextu inform provid applic data user show process call kernel trick nonlinear relationship learn effici project space addit kernel trick propos algorithm enhanc effici effect function learn effici propos smo solver achiev learn perform effect propos unsupervis learn innov address challeng lack label data contextu inform theoret substanti method sound optim empir demonstr method effect multimod metadata fusion causal strength extent fuse context content semant ontolog photo annot pivot index support vector machin queri manifold learn promis land work progress task imag cluster classif deal data high dimens allevi dimension curs method isomap lle kpca recent propos appli learn low dimension linear embed manifold high dimension space scenario method effect contriv work empir examin method realist difficult dataset discuss promis limit dimensionreduct scheme extent infer imag metadata context content formul distanc function kernel trick task data mine inform retriev depend good distanc function measur similar data instanc effect distanc function formul contextdepend applic data user depend paper propos learn distanc function captur nonlinear relationship contextu inform provid applic data user show process call kernel trick nonlinear relationship learn effici project space theoret substanti method sound optim empir dataset applic demonstr method effect exploit geometri support vector machin index kroneck factor speed kernel machin kernel machin kernel princip compon analysi kpca gaussian process gp support vector machin svm comput complex find solut number train instanc reduc expens comput complex propos kroneck factor approxim posit definit kernel matrix kroneck product smaller posit definit matric approxim speed calcul kernel matrix invers eigendecomposit involv kernel machin factor matric dimens comput complex improv larg kroneck factor recurs appli reduc comput complex propos method carri kroneck factor appli speed kpca gp addit propos effect approxim method gaussian process classif integr surrog maxim algorithm kroneck factor experi show method drastic reduc comput time kernel machin signific degrad effect system support preemptiv disk schedul abstract allow higher prioriti request preempt ongo disk io benefit delai sensit real time system paper present semi preemptibl io divid disk io request small tempor unit disk command improv preemptibl disk access lai main design strategi preemption compon disk access seek rotat data transfer seek split jit seek chunk present preemption mechan singl multidisk system jit preemption jit migrat evalu prototyp system show semi preemptibl io substanti improv preemptibl disk access loss disk throughput preemptiv disk schedul improv respons time high prioriti interact request index term storag preemptibl disk access preemptiv disk schedul real time qo disk io preemption dclass dclass svm multiclass imag annot kba kernel boundari align imbalanc data distribut semant featur discoveri confid dbase ensembl multimod concept ddepend activ learn imag retriev distanc dfunction design fusion sequenc data scalabl activ learn formul queri concept adapt sampl sensor network distribut data stream architectur find applic sensor network monitor environ activ network larg number sensor deliv continu data central server rate data sampl sensor affect commun resourc comput load central server paper propos adapt sampl techniqu sampl rate sensor adapt stream data characterist approach emploi kalman filter kf base estim techniqu sensor kf estim error adapt adjust sampl rate rang autonom desir sampl rate violat rang sampl rate request server server alloc sampl rate constraint resourc kf estim error activ stream sensor minim empir studi demonstr flexibl effect model align boundari kernel space learn imbalanc dataset multimod inform fusion video concept detect build robust intellig video surveil system case studi prolifer inexpens camera avail larg capac disk storag ubiquit presenc high speed broad band commun network econom technic feasibl construct deploi multi camera video surveil system line intellig robust semi autom video analysi paradigm assist oper scene analysi event classif paper summar current research work realiz multi camera video surveil system activ learn scalabl imag retriev adapt stream resourc manag kalman filter amp gt lt de lt de lt amp gt amp xk amp amp amp gt amp xk gt amp amp amp lt gt wcc gt wcc amp gt amp gt ygfv amp gt lt bhjfv bwh amp jfv lt ln qc amp nv gt ud lt bfvo gt ud lt bfvo amp nv kc lt lt bfvo amp lt lt bfvo amp amp lt lt bfvo amp amp lt lt bfvo amp gt amp lt lt bfvo introduct special issu video surveil confid dbase dynam ensembl imag annot semant discoveri provid accur scalabl solut map low level perceptu featur high level semant critic multimedia inform organ retriev paper propos confid base dynam ensembl cde overcom shortcom tradit static classifi contrast tradit model cde make dynam adjust accommod semant assist discoveri low level featur improv class predict accuraci depict kei compon cde multi level function assert class predict confid dynam ensembl method base confid function theoret analysi empir studi demonstr cde ectiv annot larg scale real world imag dataset multi dcamera spatio dtempor fusion bias sequenc ddata learn secur surveil paper propos framework multi camera video surveil framework address detect represen recognit motion event detect phase handl spatiotempor data fusion effici reliabl extract motion trajectori video represent phase summar raw trajectori data construct hierarch invari content rich represent motion event final recognit phase deal learn imbalanc train dataset infinitedimension data exhibit tempor order due space limit compon discuss paper fuse spatio tempor inform multipl camera sourc character detect suspici surveil event invari featur extract bias statist infer video surveil camera detect hazard suspici event spur research secur concern make detect reliabl research overcom difficulti variat camera capabl environment factor imbal posit neg train data asymmetr cost misclassifi event class event detect framework propos present paper framework major compon invari featur extract bias statist infer enhanc dpf dreplica imag recognit design implement semi dpreemptibl io allow higher prioriti request preempt ongo disk io benefit delai sensit multimedia real time system paper propos semi preemptibl io divid io request small tempor unit disk command enabl preemptibl disk access present main design strategi preemption compon disk access seek rotat data transfer analyz perform describ implement challeng evalu show semi preemptibl io substanti reduc io wait time loss disk throughput expect wait time disk io video stream system reduc time throughput loss percent mem dbase disk buffer stream media server perform stream media server limit due dual requir high throughput low memori disk throughput enjoi annual increas slower improv disk access time necessit larg dram buffer improv stream throughput mem base storag excit technolog promis bridg widen perform gap dram disk drive memori hierarchi paper explor impact integr devic memori hierarchi class stream media applic evalu mem base storag buffer cach stream data show bank mem devic manag configur provid fold improv throughput access latenc extens analyt studi show mem storag reduc buffer cost improv throughput stream server significantli statist learn effect visual inform retriev effect retriev visual inform statist learn plai pivot role statist learn context face major mathemat challeng scarciti train data imbal train class present challeng outlin method address activ learn recurs subspac train adapt dimension reduct class boundari align quasi bag adapt featur dspace conform transform imbalanc ddata learn train instanc target class heavili outnumb target train instanc svm ineffect determin class boundari remedi problem propos adapt conform transform act algorithm act consid featur space distanc class imbal ratio perform conform transform kernel function experiment result uci real world dataset show act effect improv class predict accuraci anatomi multimod inform filter imag copi detect dynam partial function imag copi detect dynam partial function framework detect hazard event mega maxim expect gener algorithm learn complex queri concept exact queri concept increasingli challeng end user queri concept multimedia object hard articul articul subject studi propos queri concept learner learn queri criteria intellig sampl process concept learner aim ful ll primari design object express order model practic queri concept learn concept quickli small number label data onlin user tend impati provid feedback ful ll rst goal model queri concept cnf express practic queri concept ful ll design goal propos maxim expect gener algorithm mega converg target concept quickli complementari step sampl select concept nement propos divid conquer method divid concept learn task subtask achiev speedup notic task divid carefulli search accuraci su er wethu emploi genet base mine algorithm discov good featur group analysi mine result observ organ imag featur multi resolut manner minim intragroup featur correl speed queri concept learn substanti maintain high search accuraci exampl analysi experi prototyp implement show mega converg queri concept signi cantli faster tradit method keyword queri concept relev feedback activ learn data mine cbsa content dbase soft annot multimod imag retriev bay point machin propos content base soft annot cbsa procedur provid imag semant label annot procedur start label small set train imag singl semant label forest anim sky ensembl binari classifi train predict label membership imag train ensembl appli individu imag give imag multipl soft label label label membership factor select base binari classifi cbsa experi learn method support vector machin svm bay point machin bpm compar class predict accuraci empir studi categori imag set show bpm base ensembl annot qualiti svm base ensembl support multimod imag retriev fine dgrain devic manag interact media server abstract interact media gain consider popular interact viewer vcr control slow motion paus fast forward instant replai tradit server base client base approach support interact consum network bandwidth requir larg client buffer econom unattract paper propos architectur design interact media proxi imp server transform noninteract broadcast multicast stream interact servic larg number end user imp work cost effect carefulli manag storag devic need cach volumin media data regard propos fine grain devic manag strategi consist complementari compon disk profil data placement io schedul quantit analysi experi show fine grain strategi consider improv devic throughput workload scenario index term data placement disk profil interact io schedul media server stream video demand discoveri perceptu distanc function measur imag similar virtual io preemptibl disk access support preemptibl disk access essenti interact multimedia applic requir short respons time studi propos virtual io abstract disk io transform nonpreempt io request preemptibl order achiev object effici virtual io disk profil obtain accur detail knowledg disk implement virtual io show virtual io enabl highli preemptibl disk access loss disk throughput pbir dmm multimod imag retriev annot dyndex dynam dmetric space index date research work content base imag retriev cbir commun minkowski function measur similar imag paper present metric distanc function dynam partial function dpf work significantli minkowskilik function measur perceptu similar explain dpf link similar theori cognit scienc propos dyndex index method deal dynam metric aspect distanc function dyndex emploi statist method includ distancebas classif bag enabl ecient index dpf addit effici conduct similar search high dimension space show dyndex remain effect featur weight dynam support person search architectur web dbase collabor imag search engin morf distribut multimod inform filter system index imag high ddimension dynam dweight featur space cluster approxim similar search high ddimension space abstract paper present cluster index paradigm call clindex high dimension search space scheme design approxim similar search find data point target point toler miss point search scheme find point high recal io perform significantli approach scheme base find cluster build simpl effici index analyz trade off involv cluster build index structur present extens experiment result index term approxim search cluster high dimension index similar search support vector machin activ learn imag retriev relev feedback critic compon design imag databas databas difficult queri directli explicitli relev feedback interact determinin user desir output queri concept user propos imag relev relev feedback algorithm effect grasp user queri concept accur quickli user label small number imag propos support vector machin activ learn algorithm conduct effect relev feedback imag retriev algorithm select inform imag queri user quickli learn boundari separ imag satisfi user queri concept rest dataset experiment result show algorithm achiev significantli higher search accuraci tradit queri refin scheme round relev feedback pbir percept dbase imag retriev da system quickli captur subject imag queri concept svm binari classifi ensembl imag classif spin discrimin analysi sda ddimension classifi high dimension classif problem mine imag featur effici queri process answer queri presenc limit access pattern inform integr system sourc relat limit access pattern data provid valu attribut relat order retriev tupl paper fundament problem comput complet answer queri access relat legal pattern complet answer queri answer comput retriev tupl relat give algorithm solv problem class queri includ conjunct queri union conjunct queri conjunct queri arithmet comparison prove problem undecid datalog queri complet answer queri comput comput maxim answer problem studi conjunct queri relat limit access pattern test maxim answer data placement multi duser interact dtv paper propos interact dtv design convert interact broadcast dtv stream interact multipl simultan viewer enabl view interact show critic organ data intellig improv io resolut reduc disk latenc minim storag cost propos data placement scheme offer tradeoff io resolut disk latenc storag emploi scheme workload scenario intellig system minim memori system cost learn imag queri concept intellig sampl nnew nearest neighbor expans weight imag databas retriev pbir percept dbase imag retriev answer queri bind paper propos queri plan framework answer queri presenc limit access pattern framework queri sourc descript translat recurs datalog program solv optim problem framework includ decid access queri sourc choos sourc queri test queri contain develop algorithm solv problem construct effici program answer queri queri plan limit sourc capabl inform integr system sourc divers limit queri capabl paper show sourc restrict retriev inform sourc mention queri contribut queri result provid bind case access sourc repeatedli retriev bind answer queri queri plan consider challeng find obtain answer queri translat queri sourc descript simpl recurs datalog program evalu program sourc relat program access sourc queri access essenti provid bind queri sourc access proven add queri answer show case queri access useless prove case comput maxim qo interact dtv client dtv client dbase interact dtv architectur abstract studi present client base architecturethat support time shift digit tv dtv featur paus replai fast forward interac tive applic call architectur ssdtvfor personaliz interact digit tv architectur studi focus devis effect tech niqu manag client data textual binari video audio data local sourc constraint outlin challeng ssdtv face sketch data resourc man agement polici maxim client qo adapt base individu viewer qual iti requir present prototyp built describ arrai applic ssdtv realiz medic memori disk cach multimedia client paper focu client side present combin memori disk buffer algorithm client dynam effect deal variabl data rate delai call algorithm medic memori disk cach medic manag resourc client comput set top box medic carefulli alloc limit memori compet task receiv data network write data disk memori fill read data disk need hold data decod playback data concurr written disk cach read disk cach medic intellig issu io avoid undu conflict powerbookmark system personaliz web inform organ user web overload inform medium pollut redund erron low qualiti inform www survei user conduct april user report find info problem user report organ collect inform problem empir studi user revisit pattern www page found individu page revisit studi result web user build organ larger collect bookmark futur refer maintain system architectur powerbookmark develop auspic larger webdb project address issu webdb hypermedia databas system built top nec percio object orient databas manag ment system unlik search engin fo bubbleup manag parallel disk media server studi present scheme call dimension bubbleup db manag parallel disk multimedia server goal reduc initi latenc interact multimedia applic balanc disk load maintain high throughput db scheme consist data placement request schedul polici data placement polici replic frequent access data place cyclic disk request schedul polici attempt maintain free servic slot futur slot quickli servic newli arriv request exampl simul show scheme significantli reduc initi latenc maintain throughput compar tradit scheme keyword multimedia data replic initi latenc disk arrai introduct media server design provid larg number present form audio movi new clip server imag code reconstruct scheme mobil comput abstract asynchron transfer mode atm wireless network bursti high error rate combat contigu bit loss due damag drop packet paper present code packet imag reconstruct scheme packet method distribut loss frequenc spatial domain reduc chanc adjac dct block lose frequenc compon imag reconstruct take consider spatial characterist repres frequenc compon combin approach reconstruct damag imag accur high loss rate addit reconstruct techniqu comput effici conserv system resourc power consumpt restrict mobil comput keyword multimedia compress mobil comput introduct studi propos imag video data deliveri scheme wire channel mobil comput gain popular recent year import devis robust techniqu work mobil environ paper present imag code reconstruct techniqu suitabl mobil wireless environ cost dbase media server design convent wisdom hold reduc disk latenc lead higher disk util maxim disk util lead higher throughput emploi faster disk lead perform true build convent file databas system paper show principl mislead appli media server design server propos cost base approach focus perstream cost give exampl illustr design process keyword multimedia disk latenc memori util stream cost introduct maxim throughput common design object media server improv throughput approach reduc disk latenc seek overhead rotat delai minim requir memori reduc disk latenc emploi effici disk schedul enact intellig data placement polici method effect bubbleup low latenc fast dscan media server interact multimedia applic requir fast respons time tradit disk schedul scheme incur high latenc cach data memori reduc latenc feasibl fast scan support studi propos disk base solut call bubbleup significantli reduc initi latenc request fast scan request throughput scheme compar tradit scheme provid throughput mechan base elev disk schedul bubbleup incur slight disk storag overhead argu effect alloc cost minim effect memori media server number techniqu develop maxim disk util media server includ disk arm schedul data placement paper focu effici util memori present techniqu memori disk polici deriv precis formula comput memori show proper memori maxim disk util necessarili lead optim throughput addit studi impact data placement polici includ disk partit multipl disk final analysi show maxim disk util disk stripe incur high system cost advis media server reduc initi latenc media server step deduct dalgorithm verif reactiv real dtime system reduc initi latenc multimedia storag system multimedia server deliv present video movi game provid high bandwidth continu real time deliveri paper present techniqu reduc initi latenc present reduc time arriv request start present tradition initi latenc receiv attent major applic multimedia server movi demand delai minut multi hour movi start accept latenc reduct import interact applic video game brows multimedia document latenc reduct scheme propos analyz perform compar show techniqu significantli reduc elimin case initi latenc advers affect throughput disk partial data replic scheme propos prove mo cost analys vbr video server paper compar techniqu storag real time retriev variabl bit rate vbr video data multipl simultan user motiv vbr video result inher time vari data averag bit rate higher qualiti achiev vbr constant bit rate cbr propos compar class vbr data placement retriev techniqu constant time length ctl place retriev data block equal playback durat constant data length cdl place retriev constant size data block hybrid solut cdl placement retriev variabl number block servic round found ctl data placement lower buffer requir cdl suffer fragment video edit show hybrid placement advantag high effici low fragment address issu admi step stanford tempor prover describ stanford tempor prover step system develop support comput aid formal verif concurr reactiv system base tempor specif unlik system base model check step restrict finit state system combin model check deduct method verif broad class system includ program infinit data domain process program compon circuit design arbitrari short step design object combin express deduct method simplic model check verif process part automat user interact occur highest intuit level primarili graphic proof languag verif diagram effici simplif method decis procedur invari gener techniqu invok automat prove result order ve admiss control data placement vbr video server composit verif real dtime system paper present composit proof system verif real time system real time system model time transit modul explicitli model interact environ combin composit oper composit rule devis correct system determin correct compon proof rule demonstr fischer mutual exclus algorithm mutual exclus bound respons proven introduct paper present composit proof system verif real time system real time system class reactiv system system exhibit ongo interact environ distinguish observ correct real time system depend qualit aspect behavior quantit timeli behavior real time system model time transit scalabl video data placement parallel disk arrai character tempor properti class paper present character class properti reactiv system term express tempor logic famili character concern safeti progress classif describ hierarchi set tempor properti previou character hierarchi depend critic past tempor oper character present identifi futur formula belong class character shown complet character concern safeti live classif partit tempor properti class safeti live automata theoret tempor logic character safeti class time complet character live class tempor logic remain open paper character introduct reactiv system system expect open extens event dbase transact manag 